A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements

نویسندگان

  • S. Ali Hojjat
  • John Turner
  • Suleyman Cetintas
  • Jian Yang
چکیده

Motivated by recent trends in online advertising and advancements made by online publishers, we consider a new form of contract which allows advertisers to specify the number of unique individuals that should see their ad (reach), and the minimum number of times each individual should be exposed (frequency). We develop an optimization framework that aims for minimal under-delivery and proper spread of each campaign over its targeted demographics. As well, we introduce a pattern-based delivery mechanism which allows us to integrate a variety of interesting features into a website’s ad allocation optimization problem which have not been possible before. For example, our approach allows publishers to implement any desired pacing of ads over time at the user level or control the number of competing brands seen by each individual. We develop a two-phase algorithm that employs column generation in a hierarchical scheme with three parallelizable components. Numerical tests with real industry data show that our algorithm produces high-quality solutions and has promising run-time and scalability. Several extensions of the model are presented, e.g., to account for multiple ad positions on the webpage, or randomness in the website visitors’ arrival process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Delivering Guaranteed Display Ads under Reach and Frequency Requirements

We propose a novel idea in the allocation and serving of online advertising. We show that by using predetermined fixedlength streams of ads (which we call patterns) to serve advertising, we can incorporate a variety of interesting features into the ad allocation optimization problem. In particular, our formulation optimizes for representativeness as well as userlevel diversity and pacing of ads...

متن کامل

Optimal Dynamic Auctions for Display Advertising

We investigate the optimal dynamic auction design for the display advertising industry. Currently, display advertising is sold through two markets side-by-side. In the traditional guaranteed market, the publisher commits to deliver a pre-specified number of impressions within a fixed time frame through a guaranteed contract. In the spot market, the publisher runs an auction to allocate the impr...

متن کامل

A UNIFIED MODEL FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH UNCERTAIN ACTIVITY DURATIONS

In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...

متن کامل

The Planning of Guaranteed Targeted Display Advertising

As targeted advertising becomes prevalent in a wide variety of media vehicles, planning models become increasingly important to ad networks that need to match ads to appropriate audience segments, provide a high quality of service (meet advertisers’ goals), and ensure that ad serving opportunities are not wasted. We define Guaranteed Targeted Display Advertising (GTDA) as a class of media vehic...

متن کامل

An Optimal NPV Project Scheduling with Fixed Work Content and Payment on Milestones

    Project scheduling   Net present value   We consider a project scheduling problem with permitted tardiness and discrete time/resource trade-offs under maximum net present value objective. In this problem, a project consists of a set of sequential phases such that each phase contains one or more sub-projects including activities interrelated by finish-start-type precedence relations with a t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2017